A historical note on Gauss-Kronrod quadrature
نویسنده
چکیده
The idea of Gauss–Kronrod quadrature, in a germinal form, is traced back to an 1894 paper of R. Skutsch. The idea of inserting n+1 nodes into an n-point Gaussian quadrature rule and choosing them and the weights of the resulting (2n+1)-point quadrature rule in such a manner as to maximize the polynomial degree of exactness is generally attributed to A.S. Kronrod [2], [3]. This is entirely justified, given that Kronrod developed the underlying theory and produced extensive numerical tables. The same idea, nevertheless, can be traced back at least to 1894, when R. Skutsch [5] pointed out the possibility of obtaining in this way a (2n + 1)-point formula of degree of exactness 3n + 1 (resp. 3n + 2 if n is odd). He also notes that the degree of exactness of the n-point Gauss formula cannot be improved by inserting fewer than n+1 points (ibid., p. 81), a result proved later by Monegato [4, Lemma 1]. On p. 83, the paper also gives numerical results to 11 decimal digits for the integral ∫ 1 −1 dx/(x+3) = ln 2. The 7-point extension of the 3-point Gauss formula is compared in this example with, among others, the 3-point and 7point Gauss formulae. Only end results are stated, none of the respective quadrature formulae. They are all correct to 11 digits, except for the result for the 7-point extension, which is off in the last two digits. Could it be that Stieltjes knew about Skutsch’s paper? In his last letter to Hermite [1, Vol. 2, p. 439], dated November 8, 1894, Stieltjes considered orthogonal polynomials relative to a sign-variable weight function (a Legendre polynomial), which are relevant to the Kronrod extension of Gauss formulae, but makes no reference to mechanical quadrature.
منابع مشابه
Stieltjes Polynomials and the Error of Gauss-kronrod Quadrature Formulas
The Gauss-Kronrod quadrature scheme, which is based on the zeros of Legendre polynomials and Stieltjes polynomials, is the standard method for automatic numerical integration in mathematical software libraries. For a long time, very little was known about the error of the Gauss-Kronrod scheme. An essential progress was made only recently, based on new bounds and as-ymptotic properties for the S...
متن کاملError estimates for Gauss–Turán quadratures and their Kronrod extensions
We study the kernel Kn,s(z) of the remainder term Rn,s( f ) of Gauss–Turán–Kronrod quadrature rules with respect to one of the generalized Chebyshev weight functions for analytic functions. The location on the elliptic contours where the modulus of the kernel attains its maximum value is investigated. This leads to effective L∞-error bounds of Gauss–Turán–Kronrod quadratures. Following Kronrod,...
متن کاملComputation of Gauss-kronrod Quadrature Rules with Non-positive Weights
Recently Laurie presented a fast algorithm for the computation of (2n + 1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. We describe modifications of this algorithm that allow the computation of Gauss-Kronrod quadrature rules with complex conjugate nodes and weights or with real nodes and positive and negative weights.
متن کاملQuadrature rules for rational functions
It is shown how recent ideas on rational Gauss-type quadrature rules can be extended to Gauss-Kronrod, Gauss-Turr an, and Cauchy principal value quadrature rules. Numerical examples illustrate the advantages in accuracy thus achievable. 0. Introduction The idea of constructing quadrature rules that are exact for rational functions with prescribed poles, rather than for polynomials, has received...
متن کاملOn Product Integration with Gauss-kronrod Nodes
Gauss-Kronrod product quadrature formulas for the numerical approximation of R 1 ?1 k(x)f (x)dx are shown to converge for every Riemann integrable f , and to possess optimal stability. Similar results are proved for the product formulas based on the Kronrod nodes only. An application to the uniform convergence of approximate solutions of integral equations is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 100 شماره
صفحات -
تاریخ انتشار 2005